Ratifiable Mechanisms: Learning from Disagreement
نویسندگان
چکیده
منابع مشابه
Ratifiable Mechanisms: Learning from Disagreement
In a mechanism design problem, participation constraints require that all types prefer the proposed mechanism to some status quo. If equilibrium play in the status quo mechanism depends on the players’ beliefs, then the inference drawn if someone objects to the proposed mechanism may alter the participation constraints. We investigate this issue by modeling the mechanism design problem as a two...
متن کاملPasadena, California 91125 Ratifiable Mechanisms: Learning from Disagreement
In a mechanism design problem, participation constraints require that all types prefer the proposed mechanism to some status quo alternntive. If the payoffs in the status quo depend on strategic actions based on the players' beliefs, then the inferences players make in the event someone objects to the proposed mechanism may alter the prirticipation constraints. We include this possibility for l...
متن کاملActive Learning: Disagreement Coefficient
In previous lectures we saw examples in which active learning gives an exponential improvement in the number of labels required for learning. In this lecture we describe the Disagreement Coefficient —a measure of the complexity of an active learning problem proposed by Steve Hanneke in 2007. We will derive an algorithm for the realizable case and analyze it using the disagreement coefficient. I...
متن کاملLearning and Disagreement in an Uncertain World∗
Most economic analyses presume that there are limited differences in the prior beliefs of individuals, an assumption most often justified by the argument that sufficient common experiences and observations will eliminate disagreements. We investigate this claim using a simple model of Bayesian learning. Two individuals with different priors observe the same infinite sequence of signals about so...
متن کاملBeyond Disagreement-Based Agnostic Active Learning
We study agnostic active learning, where the goal is to learn a classifier in a pre-specified hypothesis class interactively with as few label queries as possible, while making no assumptions on the true function generating the labels. The main algorithms for this problem are disagreement-based active learning, which has a high label requirement, and margin-based active learning, which only app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 1995
ISSN: 0899-8256
DOI: 10.1006/game.1995.1032